Dynamical effects of a one-dimensional multibarrier potential of finite range

We discuss the properties of a large number N of one-dimensional (bounded) locally periodic potential barriers in a finite interval. We show that the transmission coefficient, the scattering cross section $\sigma$, and the resonances of $\sigma$ depend sensitively upon the ratio of the total spacing to the total barrier width. We also show that a time dependent wave packet passing through the system of potential barriers rapidly spreads and deforms, a criterion suggested by Zaslavsky for chaotic behaviour. Computing the spectrum by imposing (large) periodic boundary conditions we find a Wigner type distribution. We investigate also the S-matrix poles; many resonances occur for certain values of the relative spacing between the barriers in the potential

Diffusion-limited reaction for the one-dimensional trap system

We have previously discussed the one-dimensional multitrap system of finite range and found the somewhat unexpected result that the larger is the number of imperfect traps the higher is the transmission through them. We discuss in this work the effect of a small number of such traps arrayed along either a constant or a variable finite spatial section. It is shown that under specific conditions, to be described in the following, the remarked high transmission may be obtained for this case also. Thus, compared to the theoretical large number of traps case these results may be experimentally applied to real phenomenaComment: 18 pages, 8 PS Figures; 3 former figures were removed, a new section added and the representation is improve

Presidential Inability and Vice Presidential Vacany: With Questions and Answers

Pamphlet distributed at ABA luncheon in May 1964 at which former President Eisenhower expressed his position on the proposed Twenty-Fifth Amendment. The pamphlet subsequently was distributed to lawyers across the country. Dean John Feerick assisted in the drafting.https://ir.lawnet.fordham.edu/miscellanea/1003/thumbnail.jp

Randomized Algorithms for the Loop Cutset Problem

We show how to find a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in the method of conditioning for inference. Our randomized algorithm for finding a loop cutset outputs a minimum loop cutset after O(c 6^k kn) steps with probability at least 1 - (1 - 1/(6^k))^c6^k, where c > 1 is a constant specified by the user, k is the minimal size of a minimum weight loop cutset, and n is the number of vertices. We also show empirically that a variant of this algorithm often finds a loop cutset that is closer to the minimum weight loop cutset than the ones found by the best deterministic algorithms known

Tracking the Tracker from its Passive Sonar ML-PDA Estimates

Target motion analysis with wideband passive sonar has received much attention. Maximum likelihood probabilistic data-association (ML-PDA) represents an asymptotically efficient estimator for deterministic target motion, and is especially well-suited for low-observable targets; the results presented here apply to situations with higher signal to noise ratio as well, including of course the situation of a deterministic target observed via clean measurements without false alarms or missed detections. Here we study the inverse problem, namely, how to identify the observing platform (following a two-leg motion model) from the results of the target estimation process, i.e. the estimated target state and the Fisher information matrix, quantities we assume an eavesdropper might intercept. We tackle the problem and we present observability properties, with supporting simulation results.Comment: To appear in IEEE Transactions on Aerospace and Electronic System